A Brief Introduction to Stack Sorting
نویسنده
چکیده
The problem of stack sorting was introduced by Knuth in the 1960s. He described the stack sorting operation as the movement of railway cars across a railroad switching network. The problem is also similar to the childhood game of Hanoi Towers, in which the player is supposed to move concentric discs of varying sizes from one side across to another without placing a bigger disc above a smaller one. This paper aims to introduce the basic concept of stack sorting to the reader.
منابع مشابه
A Brief Look into Spike Sorting Methods
Spike sorting is a class of techniques used in the analysis of electrophysiological data. Studying the dynamics of neural activity via electrical recording relies on the ability to detect and sort neural spikes recorded from a number of neurons by the same electrode. This article reviews methods for detecting and classifying action potentials, a problem commonly referred to as spike sorting.
متن کاملStack-based sorting algorithms
The emergence of stacks as a hardware device in stack machines implies the recognition of the importance of using stacks in different computer applications and the need to make use of them in others. This paper uses stacks to solve the sorting problem. Two stack-based sorting algorithms are introduced. The first is based upon sorting by the insertion technique, whereas the second is based upon ...
متن کامل2-stack Pushall Sortable Permutations
In the 60’s, Knuth introduced stack-sorting and serial compositions of stacks. In particular, one significant question arise out of the work of Knuth: how to decide efficiently if a given permutation is sortable with 2 stacks in series? Whether this problem is polynomial or NP-complete is still unanswered yet. In this article we introduce 2-stack pushall permutations which form a subclass of 2-...
متن کاملA Stack and a Pop Stack in Series
We study sorting machines consisting of a stack and a pop stack in series, with or without a queue between them. While there are, a priori, four such machines, only two are essentially different: a pop stack followed directly by a stack, and a pop stack followed by a queue and then by a stack. In the former case, we obtain complete answers for the basis and enumeration of the sortable permutati...
متن کاملStack Management and Calling Conventions
Despite the advantages and simplicity of stack machines, they are not very often found or supported in commercial computer systems. This paper explains the need for stacks in modern programming languages and describes three dimensions used to categorize the different stack implementations. Furthermore, we will discuss the application and support of stacks and their integration in modern computi...
متن کامل